Computational logic - PDFSEARCH.IO - Document Search Engine

Computational logic
Results: 652

#	Item
511	Bi-Immunity Separates Strong NP-Completeness Notions A. Pavan?1 and Alan L Selman2 1 2 Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2001-12-13 15:38:53 NP-complete NP P Combinatory logic P versus NP problem Computational complexity theory Theoretical computer science Complexity classes Applied mathematics
512	Efield 6.0 FDTD Performance and Scalability •The Efield 6.0 FDTD solver introduces a number of improvements for high-performance computing Add to Reading List Source URL: www.ctsystemes.com Language: English - Date: 2011-12-08 06:37:50 Electrodynamics Electromagnetism Finite-difference time-domain method Logic simulation Parallel computing Electronic engineering Physics Computational science
513	Microsoft Word - Template Add to Reading List Source URL: etienne.ece.jhu.edu Language: English - Date: 2012-04-26 13:22:49 Applied mathematics Mathematics Neural networks Computational neuroscience Evolutionary algorithms Natural computing Theoretical computer science Algorithm Mathematical logic
514	Ancient symbols, computational linguistics, and the reviewing practices of the general science journals Richard Sproat∗ Center for Spoken Language Understanding Add to Reading List Source URL: rws.xoba.com Language: English - Date: 2010-07-09 14:35:17 Formal languages Natural language processing Logical syntax Metalogic Indus Valley Civilization Indus script Entropy Writing system Pictish stones Science Linguistics Logic
515	EXploring Customer Interactions through Textual EntailMENT http://www.excitement-project.eu/ EXCITEMENT is a 3-year research project[removed]) funded by the European Commission under FP7. The project consortium in Add to Reading List Source URL: excitement-project.eu Language: English - Date: 2014-02-07 05:39:38 Knowledge Natural language processing Computational linguistics Data analysis Textual entailment Statistical natural language processing Inference Text analytics Entailment Logic Science Logical consequence
516	Short Proofs are Narrow – Resolution made Simple Eli Ben-Sasson ∗ Add to Reading List Source URL: www.math.ias.edu Language: English - Date: 2002-04-25 05:57:27 Theoretical computer science Automated theorem proving Rules of inference Propositional calculus Logic in computer science Resolution Tautology Computational complexity theory Mathematical proof Mathematical logic Mathematics Logic
517	27 January 2007, ACM Transactions on Computational Logic, Vol. 8 (1:1), 2007, pp. 1–64 A System of Interaction and Structure Alessio Guglielmi University of Bath Bath BA2 7AY Add to Reading List Source URL: cs.bath.ac.uk Language: English - Date: 2007-12-18 10:38:50 Noncommutative logic Linear logic Natural deduction Substructural logic Cut-elimination theorem Sequent Curry–Howard correspondence Deep inference Admissible rule Logic Mathematical logic Proof theory
518	Optimal acceptors and optimal proof systems Edward A. Hirsch? Steklov Institute of Mathematics at St. Petersburg, 27 Fontanka, St. Petersburg[removed], Russia http://logic.pdmi.ras.ru/~hirsch/ Add to Reading List Source URL: logic.pdmi.ras.ru Language: English - Date: 2010-03-28 09:40:37 Complexity classes Structural complexity theory Mathematical optimization Probabilistic complexity theory NP P versus NP problem Propositional proof system PP Mathematical proof Theoretical computer science Computational complexity theory Applied mathematics
519	Optimal heuristic algorithms for the image of an injective function∗ Edward A. Hirsch† Dmitry Itsykson† Valeria Nikolaenko‡ Add to Reading List Source URL: logic.pdmi.ras.ru Language: English - Date: 2011-08-01 04:42:41 Complexity classes Analysis of algorithms Quantum complexity theory Probabilistic complexity theory Randomized algorithm NP PP Algorithm Time complexity Theoretical computer science Computational complexity theory Applied mathematics
520	IEEE TRANSACTIONS ON COMPUTATIONAL INTELLIGENCE AND AI IN GAMES, VOL. 3, NO. 3, SEPTEMBER[removed]Answer Set Programming for Procedural Content Generation: A Design Space Approach Add to Reading List Source URL: adamsmith.as Language: English - Date: 2013-03-17 01:17:47 Programming paradigms Logic programming Constraint programming Operations research NP-complete problems Answer set programming Maze Boolean satisfiability problem Solver Software engineering Theoretical computer science Computing

UPDATE